Infinite behaviour of Petri nets

Infinite Behaviour of Petri Nets

Infinite behaviour and fairness in Petri nets

Several classes of ~-languages of labelled Petri nets are defined and related to each other. Since such nets can be interpreted to behave fair, these notions are compared with explicit definitions of fairness for nets.

Observability of continuous Petri nets with infinite server semantics

Timed continuous Petri net (contPN) systems with infinite server semantics are non-linear systems, particularly a subclass of piecewise linear (PWL) systems. This paper addresses several problems regarding the state observability of these systems. We assume that the initial marking/state is not known and measuring the marking of some places we want to estimate all the others. First, a study of ...

Matrix-Geometric Solution of Infinite Stochastic Petri Nets

I n this paper we characterize a class of stochastic Petri nets that can be solved using matrix geometric techniques. Advantages of such a n approach are that very efficient mathematical technique become available for practical usage, as well as that the problem of large state spaces can be circumvented. W e first characterize the class of stochastic Petri nets of interest by formally defining ...

Evaluating Computer-Communication Systems using Infinite-State Stochastic Petri Nets

For modelling and evaluating the performance of modern computer communication systems, quasi-birth-and-death models (QBDs) can often be used. For such QBDs, a variety of highly efficient numerical solution algorithms have been developed. For models of practically relevant size though, the specification of QBDs at the state level is cumbersome or practically infeasible. To overcome this problem,...